Tree-valued Markov chains derived from Galton-Watson processes
نویسندگان
چکیده
منابع مشابه
Tree-valued Markov Chains Derived from Galton-watson Processes
Let G be a Galton-Watson tree, and for 0 u 1 let Gu be the subtree of G obtained by retaining each edge with probability u. We study the tree-valued Markov process (Gu; 0 u 1) and an analogous process (G u; 0 u 1) in which G 1 is a critical or subcritical Galton-Watson tree conditioned to be in nite. Results simplify and are further developed in the special case of Poisson( ) o spring distribut...
متن کاملTree-valued Markov chains and Poisson-Galton-Watson distributions
The Poisson-Galton-Watson distribution on nite trees, and the related PGW 1 (1) distribution on innnite trees with one end, arise in several contexts, in particular as n ! 1 weak limits within various size-n combinato-rial models. We review this topic, introducingslick notation for describing such distributions. We then describe a family of continuous-time Markov chains whose marginal distribut...
متن کاملPruning Galton-Watson Trees and Tree-valued Markov Processes
Abstract. We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process {G(u)} by pruning Galton-Watson trees and an analogous process {G(u)} by pruning a critical or subcritical Galton-Watson tree conditioned to be infinite. Under a mild condition on offspring distributions, we show that ...
متن کاملMartin-Löf randomness and Galton-Watson processes
The members of Martin-Löf random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-Löf random Galton–Watson trees with survival parameter 2 3 . To be such a member, a sufficient condition is to have effective Hausdorff dimension strictly greater than γ = log2 3 2 , and a necessary condition is to have effective Hausdorff dimension greate...
متن کاملA symmetric entropy bound on the non-reconstruction regime of Markov chains on Galton-Watson trees
We give a criterion of the form Q(d)c(M) < 1 for the non-reconstructability of tree-indexed q-state Markov chains obtained by broadcasting a signal from the root with a given transition matrix M . Here c(M) is an explicit constant defined in terms of a q − 1-dimensional variational problem over symmetric entropies, and Q(d) is the expected number of offspring on the Galton-Watson tree. This res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincare (B) Probability and Statistics
سال: 1998
ISSN: 0246-0203
DOI: 10.1016/s0246-0203(98)80003-4